Hadamard Upper Bound (HUB) on Optimum Joint Decoding Capacity of Wyner Gaussian Cellular MAC
نویسندگان
چکیده
This paper presents an original analytical expression for an upper bound on the optimum joint decoding capacity of Wyner Circular Gaussian Cellular Multiple Access Channel (C-GCMAC) for uniformly distributed Mobile Terminals (MTs). This upper bound is referred to as Hadamard Upper Bound (HUB) and is a novel application of the Hadamard inequality established by exploiting the Hadamard operation between the channel fading H and channel slow gain Ω matrices. This paper demonstrates that the theoretical upper bound converges to the actual capacity under constraints like low range of signal to noise ratios and limiting channel slow gain among the MTs and the Base Station (BS) of interest. The behaviour of the theoretical upper bound is critically observed when the inter-cell and the intra-cell time sharing schemes are employed. In this context, we employ an approximation approach to evaluate the effect of the MT distribution on optimal joint decoding capacity for a variable user-density in C-GCMAC. This paper demonstrates that the analytical HUB based on the proposed approximation approach converges to the theoretical upper bound results for medium to high range of signal to noise ratios and shows a comparable tighter bound on optimum sum-rate capacity.
منابع مشابه
Hadamard upper bound on optimum joint decoding capacity of Wyner Gaussian cellular MAC
This article presents an original analytical expression for an upper bound on the optimum joint decoding capacity of Wyner circular Gaussian cellular multiple access channel (C-GCMAC) for uniformly distributed mobile terminals (MTs). This upper bound is referred to as Hadamard upper bound (HUB) and is a novel application of the Hadamard inequality established by exploiting the Hadamard operatio...
متن کاملDistributed Decoding for Wyner Cellular Systems
This paper investigates a one-dimensional model of a cellular Gaussian multiple-access channel based on the model introduced by Wyner. A closed form expression is given for the sumrate constraint with a finite number of cells. It is demonstrated that optimal joint decoding can be accomplished using a variation of the forward-backward algorithm that operates on the posterior codeword probabilities.
متن کاملOn the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملAchievable Rates and Outer Bound for the Half-Duplex MAC with Generalized Feedback
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each transmission block is divided into 3 time slots with variable durations: the destination is always in receive mode, while each user alternatively transmits ...
متن کاملDistortion Bounds for Source Broadcast Problem
This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the achievable distortion region are derived, which respectively generalize and unify several existing bounds. As a consequence, we also obtain an inner bound and an outer bound for degraded broadcast channel case. When sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1010.3319 شماره
صفحات -
تاریخ انتشار 2010